Uniform Intersecting Families with Covering Number Four

نویسندگان

  • Peter Frankl
  • Katsuhiro Ota
  • Norihide Tokushige
چکیده

Let X be a finite set. We denote by (~) the family of all k-element subsets of X. A family ~satisfying ~ c (~) is called k-uniform. The vertex set of @ is X and it is often denoted by V(Y). An element of ~ is also called an edge of J~. The family ~ is called intersecting if Fc~ G ¢ 25 holds for every F, G ~ ~ . A set C c X is called a cover (or transversal set) of Y if it intersects every edge of ~ ' . A cover C is also called a t-cover if [C[ = t . The set of all t-covers of ~ is denoted by cg,(~-). The covering n u m b e r of Y is the minim u m cardinal i ty of the covers and is denoted by z ( ~ ) . By the definition, r ( ~ ) = min{ t : c ~ , ( ~ ) # ~ } .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniform Intersecting Families with Covering Number Restrictions

It is known that any k-uniform family with covering number t has at most k t t-covers. In this paper, we give better upper bounds for the number of t-covers in k-uniform intersecting families with covering number t.

متن کامل

Covers in Uniform Intersecting Families and a Counterexample to a Conjecture of Lovász

We discuss the maximum size of uniform intersecting families with covering number at least . Among others, we construct a large k-uniform intersecting family with covering number k, which provides a counterexample to a conjecture of Lov asz. The construction for odd k can be visualized on an annulus, while for even k on a Mobius band.

متن کامل

Covers in 5-uniform intersecting families with covering number three

Let k be an integer. It is known that the maximum number of threecovers of a k-uniform intersecting family with covering number three is k − 3k + 6k − 4 for k = 3, 4 or k ≥ 9. In this paper, we prove that the same holds for k = 5, and show that a 5-uniform intersecting family with covering number three which has 76 three-covers is uniquely determined.

متن کامل

Most Probably Intersecting Hypergraphs

The celebrated Erdős-Ko-Rado theorem shows that for n > 2k the largest intersecting k-uniform set family on [n] has size ( n−1 k−1 ) . It is natural to ask how far from intersecting larger set families must be. Katona, Katona and Katona introduced the notion of most probably intersecting families, which maximise the probability of random subfamilies being intersecting. We consider the most prob...

متن کامل

Intersecting Families — Uniform versus Weighted

What is the maximal size of k-uniform r-wise t-intersecting families? We show that this problem is essentially equivalent to determine the maximal weight of non-uniform r-wise t-intersecting families. Some EKR type examples and their applications are included.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 71  شماره 

صفحات  -

تاریخ انتشار 1995